Section: New Results

Solving AAA constraints analytically

Participants : Emilien Kofman, Dumitru Potop Butucaru, Robert de Simone, Amine Oueslati.

We experimented on the use of SMT solvers to compute efficient mappings (bothe schedules and placement allocations) for concurrent embedded applications onto specific embedded architectures of big.LITTLE features (where alocation and migration of tasks can follow concern for low-power consumption). In fact, the work consisted greatly in a study of how the various models could be encoded to scale up, allowing the solvesr to provide results in reasonalble time. The results have been presented [41], [31], and will soon appear as E. Kofman PhD thesis.